Rapidly Mixing Markov Chain Monte Carlo Technique for Matching Problems with Global Utility Function

نویسندگان

  • Shana Moothedath
  • Prasanna Chaporkar
  • Madhu N. Belur
چکیده

This paper deals with a complete bipartite matching problem with the objective of finding an optimal matching that maximizes a certain generic predefined utility function on the set of all matchings. After proving the NP-hardness of the problem using reduction from the 3-SAT problem, we propose a randomized algorithm based on Markov Chain Monte Carlo (MCMC) technique for solving this. We sample from Gibb’s distribution and construct a reversible positive recurrent discrete time Markov chain (DTMC) that has the steady state distribution same as the Gibb’s distribution. In one of our key contributions, we show that the constructed chain is ‘rapid mixing’, i.e. the convergence time to reach within a specified distance to the desired distribution is polynomial in the problem size. The rapid mixing property is established by obtaining a lower bound on the conductance of the DTMC graph and this result is of independent interest.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Counting Perfect Matchings in General Graphs

Counting perfect matchings has played a central role in the theory of counting problems. The permanent, corresponding to bipartite graphs, was shown to be #P-complete to compute exactly by Valiant (1979), and a fully polynomial randomized approximation scheme (FPRAS) was presented by Jerrum, Sinclair, and Vigoda (2004) using a Markov chain Monte Carlo (MCMC) approach. However, it has remained a...

متن کامل

Generalizing Elliptical Slice Sampling for Parallel MCMC

Probabilistic models are conceptually powerful tools for finding structure in data, but their practical effectiveness is often limited by our ability to perform inference in them. Exact inference is frequently intractable, so approximate inference is often performed using Markov chain Monte Carlo (MCMC). To achieve the best possible results from MCMC, we want to efficiently simulate many steps ...

متن کامل

Parallel MCMC with generalized elliptical slice sampling

Probabilistic models are conceptually powerful tools for finding structure in data, but their practical effectiveness is often limited by our ability to perform inference in them. Exact inference is frequently intractable, so approximate inference is often performed using Markov chain Monte Carlo (MCMC). To achieve the best possible results from MCMC, we want to efficiently simulate many steps ...

متن کامل

Small-world Mcmc and Convergence to Multi-modal Distributions: from Slow Mixing to Fast Mixing

Department of Mathematics, University of Idaho We compare convergence rates of Metropolis–Hastings chains to multi-modal target distributions when the proposal distributions can be of “local” and “small world” type. In particular, we show that by adding occasional long-range jumps to a given local proposal distribution, one can turn a chain that is “slowly mixing” (in the complexity of the prob...

متن کامل

Portfolio selection with probabilistic utility

We present a novel portfolio selection technique, which replaces the traditional maximization of the utility function with a probabilistic approach inspired by statistical physics. We no longer seek the single global extremum of some chosen utility function, but instead reinterpret the latter as a probability distribution of ‘optimal’ portfolios, and select the portfolio that is given by the me...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1710.10037  شماره 

صفحات  -

تاریخ انتشار 2017